Boolean Posets, Posets under Inclusion and Products of Relational Structures1
نویسندگان
چکیده
In this paper X denotes a set. Let L be a lattice. Note that Poset(L) has l.u.b.’s and g.l.b.’s. Let L be an upper-bounded lattice. One can verify that Poset(L) is upper-bounded. Let L be a lower-bounded lattice. One can verify that Poset(L) is lower-bounded. Let L be a complete lattice. Note that Poset(L) is complete. Let X be a set. Then X is an order in X . Let X be a set. The functor 〈X ,⊆〉 yielding a strict relational structure is defined by:
منابع مشابه
Properties of products for flatness in the category of $S$-posets
This paper is devoted to the study of products of classes of right $S$-posets possessing one of the flatness properties and preservation of such properties under products. Specifically, we characterize a pomonoid $S$ over which its nonempty products as right $S$-posets satisfy some known flatness properties. Generalizing this results, we investigate products of right $S$-posets satisfying Condi...
متن کاملA NEW CHARACTERIZATION OF ABSOLUTELY PO-PURE AND ABSOLUTELY PURE S-POSETS
In this paper, we investigate po-purity using finitely presented S-posets, and give some equivalent conditions under which an S-poset is absolutely po-pure. We also introduce strongly finitely presented S-posets to characterize absolutely pure S-posets. Similar to the acts, every finitely presented cyclic S-posets is isomorphic to a factor S-poset of a pomonoid S by a finitely generated right con...
متن کاملCOGENERATOR AND SUBDIRECTLY IRREDUCIBLE IN THE CATEGORY OF S-POSETS
In this paper we study the notions of cogenerator and subdirectlyirreducible in the category of S-poset. First we give somenecessary and sufficient conditions for a cogenerator $S$-posets.Then we see that under some conditions, regular injectivityimplies generator and cogenerator. Recalling Birkhoff'sRepresentation Theorem for algebra, we study subdirectlyirreducible S-posets and give this theo...
متن کاملf-vectors and h-vectors of simplicial posets
Stanely, R.P., f-vectors and h-vectors of simplicial posets, Journal of Pure and Applied Algebra 71 (1991) 319-331. A simplicial poset is a (finite) poset P with d such that every interval [6, x] is a boolean algebra. Simplicial posets are generalizations of simplicial complexes. The f-vector f(P) = (f,, f,, , ,f_,) of a simplicial poset P of rank d is defined by f; = #{x E P: [6, x] g B,, I}, ...
متن کاملA bijection between intervals in the Fibonacci posets
For each word w in the Fibonacci lattices Fib(r) and Z (r) we partition the interval ^ 0; w] in Fib(r) into subposets called r-Boolean posets. In the case r = 1 those subposets are isomorphic to Boolean algebras. We also partition the interval ^ 0; w] in Z (r) into certain spanning trees of the r-Boolean posets. A bijection between those intervals is given in which each r-Boolean poset in Fib(r...
متن کامل